Vertex partition of a complete multipartite graph into two kinds of induced subgraphs
نویسندگان
چکیده
منابع مشابه
Heterochromatic tree partition number of a complete multipartite graph
A heterochromatic tree is an edge-colored tree in which any two edges have different colors. The heterochromatic tree partition number of an r-edge-colored graph G, denoted by tr(G), is the minimum k such that whenever the edges of the graph G are colored with r colors, the vertices of G can be covered by at most k vertexdisjoint heterochromatic trees. In this paper we determine the heterochrom...
متن کاملOn vertex-disjoint complete subgraphs of a graph
We conjecture that if G is a graph of order sk, where s ~3 and k 2: 1 are integers, and d(x)+d(y) ~ 2(s-1)k for every pair of non-adjacent vertices x and y of G, then G contains k vertex-disjoint complete subgraphs of order s. This is true when s = 3, [6]. Here we prove this conjecture for k ~ 6.
متن کاملComplete subgraphs in multipartite graphs
Turán’s Theorem states that every graphG of edge density ‖G‖/ (|G| 2 ) > k−2 k−1 contains a complete graph K and describes the unique extremal graphs. We give a similar Theorem for `-partite graphs. For large `, we find the minimal edge density d` , such that every `-partite graph whose parts have pairwise edge density greater than d` contains a K . It turns out that d` = k−2 k−1 for large enou...
متن کاملPartitioning the vertex set of a bipartite graph into complete bipartite subgraphs
Given a graph and a positive integer k, the biclique vertex-partition problem asks whether the vertex set of the graph can be partitioned into at most k bicliques (connected complete bipartite subgraphs). It is known that this problem is NP-complete for bipartite graphs. In this paper we investigate the computational complexity of this problem in special subclasses of bipartite graphs. We prove...
متن کاملa study of translation of english litrary terms into persian
چکیده هدف از پژوهش حاضر بررسی ترجمه ی واژه های تخصصی حوزه ی ادبیات به منظور کاوش در زمینه ی ترجمه پذیری آنها و نیز راهکار های به کار رفته توسط سه مترجم فارسی زبان :سیامک بابایی(1386)، سیما داد(1378)،و سعید سبزیان(1384) است. هدف دیگر این مطالعه تحقیق در مورد روش های واژه سازی به کار رفته در ارائه معادل های فارسی واژه های ادبی می باشد. در راستای این اهداف،چارچوب نظری این پژوهش راهکارهای ترجمه ار...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2010
ISSN: 0012-365X
DOI: 10.1016/j.disc.2010.02.012